package cn.shenzz.suixiang.dp.leetcode_746;

class Solution {

    public static void main(String[] args) {
        int[] cost = {10, 15, 20};
        int result = minCostClimbingStairs(cost);
        System.out.println("result = " + result);
    }
    public static int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        int[] dp = new int[n + 1];
        for (int i = 2; i < n + 1; ++i) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[n];
    }
}